Let $G$ be a graph on $n$ vertices and $\mathrm{STAB}_k(G)$ be the convexhull of characteristic vectors of its independent sets of size at most $k$. Westudy extension complexity of $\mathrm{STAB}_k(G)$ with respect to a fixedparameter $k$ (analogously to, e.g., parameterized computational complexity ofproblems). We show that for graphs $G$ from a class of bounded expansion itholds that $\mathrm{xc}(\mathrm{STAB}_k(G))\leqslant \mathcal{O}(f(k)\cdot n)$where the function $f$ depends only on the class. This result can be extendedin a simple way to a wide range of similarly defined graph polytopes. In caseof general graphs we show that there is {\em no function $f$} such that, forall values of the parameter $k$ and for all graphs on $n$ vertices, theextension complexity of $\mathrm{STAB}_k(G)$ is at most $f(k)\cdotn^{\mathcal{O}(1)}.$ While such results are not surprising since it is knownthat optimizing over $\mathrm{STAB}_k(G)$ is $FPT$ for graphs of boundedexpansion and $W[1]$-hard in general, they are also not trivial and in bothcases stronger than the corresponding computational complexity results.
展开▼
机译:假设$ G $是$ n $顶点的图,而$ \ mathrm {STAB} _k(G)$是其独立大小集最多$ k $的特征向量的凸包。相对于固定参数$ k $的$ \ mathrm {STAB} _k(G)$的Westudy扩展复杂度(类似于,例如,问题的参数化计算复杂度)。我们表明,对于一类有界展开图的图形$ G $,它认为$ \ mathrm {xc}(\ mathrm {STAB} _k(G))\ leqslant \ mathcal {O}(f(k)\ cdot n)$函数$ f $仅取决于类。该结果可以通过简单的方式扩展到范围广泛的相似定义的图形多面体。在一般图的情况下,我们表明没有{\ em没有函数$ f $}使得对于参数$ k $的所有值以及$ n $顶点上的所有图,$ \ mathrm {STAB} _k( G)$最多为$ f(k)\ cdotn ^ {\ mathcal {O}(1)}。$尽管这样的结果并不令人惊讶,因为已知对$ \ mathrm {STAB} _k(G)$进行优化是通常,对于有界展开图和$ W [1] $-hard图,$ FPT $也不小,并且在两种情况下都比相应的计算复杂度结果强。
展开▼